Enumerating Subtrees of Flower and Sunflower Networks

نویسندگان

چکیده

Symmetry widely exists in many complex and real-world networks, with flower networks sunflower being two richly symmetric having practical applications due to their special structures. The number of subtrees (the subtree index) is closely related the reliable network design. Using a generating function, structural analysis techniques, auxiliary structure introduction, this paper presents functions Fln,m(n≥3,m≥2) Sfn,m(n≥3,m≥2) and, thus, solves computation indices Sfn,m(n≥3,m≥2). results provide fundamental efficient method for exploring novel features cyclic from index perspective. For instance, we conclude that under some parameter constraints, are more than networks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumerating All Maximal Frequent Subtrees

Given a collection of leaf-labeled trees on a common leafset and a fraction f in (1/2,1], a frequent subtree (FST) is a subtree isomorphically included in at least fraction f of the input trees. The well-known maximum agreement subtree (MAST) problem identifies FST with f = 1 and having the largest number of leaves. Apart from its intrinsic interest from the algorithmic perspective, MAST has pr...

متن کامل

Enumerating ODE Equivalent Homogeneous Networks

We give an alternative criterion for ODE equivalence in identical edge homogeneous coupled cell networks. This allows us to give a simple proof of Theorem 10.3 of Aquiar and Dias, which characterizes minimal identical edge homogeneous coupled cell networks. Using our criterion we give a formula for counting homogeneous coupled cell networks up to ODE equivalence. Our criterion is purely graph t...

متن کامل

Integration of Color Features and Artificial Neural Networks for In-field Recognition of Saffron Flower

ABSTRACT-Manual harvesting of saffron as a laborious and exhausting job; it not only raises production costs, but also reduces the quality due to contaminations. Saffron quality could be enhanced if automated harvesting is substituted. As the main step towards designing a saffron harvester robot, an appropriate algorithm was developed in this study based on image processing techniques to recogn...

متن کامل

Subtrees 1

The concepts of root tree, the set of successors of a node in decorated tree and sets of subtrees are introduced. Let us mention that every tree which is finite is also finite-order. Next we state three propositions: (1) For every decorated tree t holds tε N = t. (2) For every tree t and for all finite sequences p, q of elements of N such that p q ∈ t holds t(p q) = tpq. (3) Let t be a decorate...

متن کامل

Thick Subtrees, Games and Experiments

We relate the dynamic semantics (games, dealing with interactions) and the static semantics (dealing with results of interactions) of linear logic with polarities, in the spirit of Timeless Games [1]. The polarized game semantics is full and faithfull for polarized proof-nets [2]. We detail the correspondence between cut free proof-nets and innocent strategies, in a framework related to abstrac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2023

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym15020284